MCPLIB: A Collection of Nonlinear Mixed Complementarity Problems
نویسندگان
چکیده
The origins and some motivational details of a collection of nonlinear mixed complementarity problems are given. This collection serves two purposes. Firstly, it gives a uniform basis for testing currently available and new algorithms for mixed complementarity problems. Function and Jacobian evaluations for the resulting problems are provided via a GAMS interface, making thorough testing of algorithms on practical complementarity problems possible. Secondly, it gives examples of how to formulate many popular problem formats as mixed complementarity problems and how to describe the resulting problems in GAMS format. We demonstrate the ease and power of formulating practical models in the MCP format. Given these examples, it is hoped that this collection will grow to include many problems that test complementarity algorithms more fully. The collection is available by anonymous ftp. Computational results using the PATH solver covering all of these problems are described.
منابع مشابه
Angewandten Mathematik An Inexact QP - based Method for Nonlinear Complementarity Problems
We consider a quadratic programming-based method for nonlinear complementarity problems which allows inexact solutions of the quadratic subproblems. The main features of this method are that all iterates stay in the feasible set and that the method has some strong global and local convergence properties. Numerical results for all complementarity problems from the MCPLIB test problem collection ...
متن کاملAn inexactQP-based method for nonlinear complementarity problems
We consider a quadratic programming-based method for nonlinear complementarity problems which allows inexact solutions of the quadratic subproblems. The main features of this method are that all iterates stay in the feasible set and that the method has some strong global and local convergence properties. Numerical results for all complementarity problems from the MCPLIB test problem collection ...
متن کاملProbability-one homotopy maps for mixed complementarity problems
Probability-one homotopy algorithms have strong convergence characteristics under mild assumptions. Such algorithms for mixed complementarity problems (MCPs) have potentially wide impact because MCPs are pervasive in science and engineering. A probability-one homotopy algorithm for MCPs was developed earlier by Billups and Watson based on the default homotopy mapping. This algorithm had guarant...
متن کاملJacobian Smoothing Methods for General Nonlinear Complementarity Problems
We present a new algorithm for the solution of general (not necessarily monotone) complementarity problems. The algorithm is based on a reformulation of the complementar-ity problem as a nonsmooth system of equations by using the Fischer-Burmeister function. We use an idea by Chen, Qi and Sun and apply a Jacobian smoothing method (which is a mixture between nonsmooth Newton and smoothing method...
متن کاملProjected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
A reformulation of the mixed complementarity problem as a box constrained overdetermined system of semismooth equations or, equivalently, a box constrained nonlinear least squares problem with zero residual is presented. Based on this reformulation, a trust region method for the solution of mixed complementarity problems is considered. This trust region method contains elements from different a...
متن کامل